home
***
CD-ROM
|
disk
|
FTP
|
other
***
search
/
ftp.cs.arizona.edu
/
ftp.cs.arizona.edu.tar
/
ftp.cs.arizona.edu
/
icon
/
newsgrp
/
group97a.txt
/
000057_icon-group-sender _Sat Mar 1 17:58:34 1997.msg
< prev
next >
Wrap
Internet Message Format
|
2000-09-20
|
1KB
Received: by cheltenham.cs.arizona.edu; Mon, 3 Mar 1997 08:32:57 MST
Date: Sat, 1 Mar 1997 17:58:34 +0200 (WET)
From: Ehud Lamm <mslamm@pluto.mscc.huji.ac.il>
To: Jan Galkowski <jan@solstice.digicomp.com>
Cc: icon-group@cs.arizona.edu
Subject: Re: Icon and two-dimensional matching
In-Reply-To: <331437DE.41C67EA6@solstice.digicomp.com>
Message-Id: <Pine.A32.3.91.970301175233.54259B-100000@pluto.mscc.huji.ac.il>
Mime-Version: 1.0
Content-Type: TEXT/PLAIN; charset=US-ASCII
Errors-To: icon-group-errors@cs.arizona.edu
Status: RO
Content-Length: 905
The problem of two dimensional matching is a problem I tend to come back
to every couple of years.
What usually stopos me from starting to hack some code, is that I don't
seem to be able to formulate a model which will be both simple enough and
sufficient to use in interesting contexts.
I usually end up desinging something specific for the problem at hand.
Examples are: Checking MineSweeper board configurations; finding sections
in HTML pages (e.g, section title from of articles); Multi-line grep etc.
If you can point me to something general along these lines - which I can
use, I'd be happy.
If you showed me a good grammer for this kind of thing - I'd be surprised
not to find it already coded and shipped.
I suggest you point your question to comp.theory as well.
Any way - I'd be happy to hear any thought on matters such as these.
Ehud Lamm mslamm@pluto.mscc.huji.ac.il